Abstraction pathologies in extensive games
نویسندگان
چکیده
ion Pathologies in Extensive Games Kevin Waugh, David Schnizlein, Michael Bowling, Duane Szafron {waugh, schnizle, bowling, duane}@cs.ualberta.ca Department of Computing Science University of Alberta Edmonton, AB, Canada T6G 2E8
منابع مشابه
No Man Should Escape Our Universities without Knowing How Little He Knows. University of Alberta Abstraction in Large Extensive Games Examining Committee
ION IN LARGE EXTENSIVE GAMES
متن کاملUsing Sliding Windows to Generate Action Abstractions in Extensive-Form Games
In extensive-form games with a large number of actions, careful abstraction of the action space is critically important to performance. In this paper we extend previous work on action abstraction using no-limit poker games as our test domains. We show that in such games it is no longer necessary to choose, a priori, one specific range of possible bet sizes. We introduce an algorithm that adjust...
متن کاملSimultaneous Abstraction and Equilibrium Finding in Games
A key challenge in solving extensive-form games is dealing with large, or even infinite, action spaces. In games of imperfect information, the leading approach is to find a Nash equilibrium in a smaller abstract version of the game that includes only a few actions at each decision point, and then map the solution back to the original game. However, it is difficult to know which actions should b...
متن کاملExtensive-Form Game Imperfect-Recall Abstractions With Bounds
Imperfect-recall abstraction has emerged as the leading paradigm for practical large-scale equilibrium computation in incomplete-information games. However, imperfect-recall abstractions are poorly understood, and only weak algorithm-specific guarantees on solution quality are known. In this paper, we show the first general, algorithm-agnostic, solution quality guarantees for Nash equilibria an...
متن کاملUsing Regret Estimation to Solve Games Compactly
Game theoretic solution concepts, such as Nash equilibrium strategies that are optimal against worst case opponents, provide guidance in finding desirable autonomous agent behaviour. In particular, we wish to approximate solutions to complex, dynamic tasks, such as negotiation or bidding in auctions. Computational game theory investigates effective methods for computing such strategies. Solving...
متن کامل